Types and trace effects of higher order programs
نویسندگان
چکیده
منابع مشابه
Types and trace effects of higher order programs
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The properties verified are based on the ordered sequence of events that occur during program execution, so called event traces. Our type and effect systems infer conservative approximations of the event traces arising at...
متن کاملInductive and Coinductive Session Types in Higher-Order Concurrent Programs
We develop a theory of inductive and coinductive session types in a computational interpretation of linear logic, enabling the representation of potentially infinite interactions in a compositionally sound way that preserves logical soundness, a major stepping stone towards a full dependent type theory for expressing and reasoning about session-based concurrent higher order distributed programs...
متن کاملModel-Checking Higher-Order Programs with Recursive Types
Model checking of higher-order recursion schemes (HORS, for short) has been recently studied as a new promising technique for automated verification of higher-order programs. The previous HORS model checking could however deal with only simply-typed programs, so that its application was limited to functional programs. To deal with a broader range of programs such as object-oriented programs and...
متن کاملTypes for Deadlock-Free Higher-Order Concurrent Programs
Deadlock freedom is for concurrent programs what progress is for sequential ones: it indicates the absence of stable (i.e., irreducible) states in which some pending operations cannot be completed. In the particular case of communicating processes, operations are inputs and outputs on channels and deadlocks may be caused by mutual dependencies between communications. In this work we define an e...
متن کاملCoinductive Session Types in Higher-Order Communication Centric Programs
We develop a theory of coinductive session types based on prior work on computational interpretations of linear logic propositions as session types. Unlike other more ad-hoc approaches to recursive session types, our typing discipline supports the compositional definition of potentially infinite interactive behaviour, as required to model realistic distributed systems, while remarkably forbiddi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2007
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796807006466